A non-CLP-compact product space whose finite subproducts are CLP-compact

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Products of sequential CLP-compact spaces are CLP-compact

It is shown that the product of finitely many sequential, CLP-compact spaces is CLPcompact. The class of spaces which have the property that every cover by clopen sets — sets which are both open and closed — has a finite subcover was introduced by A. Šostak in [1] under the name CBcompact. These spaces are now known as CLP-compact spaces and their study is linked to the question of whether the ...

متن کامل

Imagining Clp(, ) Imagining Clp(, )

We study under which conditions the domain of-terms (() and the equality theory of the-calculus () form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom , and the formula language must depart from Horn clauses and accept universal quantiications and implications in goals. In short, CLP((,) must be close to Prolog. ...

متن کامل

A First Countable, Initially Ω1-compact but Non-compact Space

We force a first countable, normal, locally compact, initially ω1-compact but non-compact space X of size ω2. The onepoint compactification of X is a non-first countable compactum without any (non-trivial) converging ω1-sequence.

متن کامل

On the product of a compact space with an hereditarily absolutely countably compact space

We show that the product of a compact, sequential T2 space with an hereditarily absolutely countably compact T3 space is hereditarily absolutely countably compact, and further that the product of a compact T2 space of countable tightness with an hereditarily absolutely countably compact ω-bounded T3 space is hereditarily absolutely countably compact.

متن کامل

Embedding extensional finite sets in CLP

In this paper we review the definition of {log}1, a logic language with sets, from the viewpoint of CLP. We show that starting with a CLP-scheme allows a more uniform treatment of the built-in set operations (namely, =, ∈ and their negative counterparts), and allows all the theoretical results of CLP to be immediately exploitable. We prove this by precisely defining the privileged interpretatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2010

ISSN: 0166-8641

DOI: 10.1016/j.topol.2010.09.001